Planarity Testing and Embedding

Universita’ di Roma Tre 3.1 Properties and Characterizations of Planar Graphs . . . . . 2 Basic Definitions • Properties • Characterizations 3.2 Planarity Problems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 3.3 History of Planarity Algorithms. . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 3.4 Common Algorithmic Techniques and Tools . . . . . . . . . . . . . 4 3.5 The Path-Addition Approach . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4 Initialization Phase • Path Decomposition Phase • Path Embedding Phase 3.6 The Vertex-Addition Approach . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5 Lempel, Even, and Cederbaum • PQ-Trees 3.7 The Block Embedding Approach . . . . . . . . . . . . . . . . . . . . . . . . . . 9 Shih and Hsu algorithm • Boyer and Myrvold algorithm